منابع مشابه
Is Scheduling a Solved Problem?
In recent years, scheduling research has had an increasing impact on practical problems, and a range of scheduling techniques have made their way into realworld application development. Constraint-based models now couple rich representational flexibility with highly scalable constraint management and search procedures. Similarly, mathematical programming tools are now capable of addressing prob...
متن کاملPhenylketonuria (PKU): A problem solved?
Phenylketonuria (PKU) is a rare metabolic disorder characterized by impaired conversion of phenylalanine (Phe) to tyrosine. If left untreated, the resultant accumulation of excess blood Phe can cause physiological, neurological, and intellectual disabilities. The National PKU Alliance (NPKUA) conducted a survey of its membership to assess current health status and interest in new treatments for...
متن کاملBit Preservation: A Solved Problem?
For years, discussions of digital preservation have routinely featured comments such as “bit preservation is a solved problem; the real issues are ... ”. Indeed, current digital storage technologies are not just astoundingly cheap and capacious, they are astonishingly reliable. Unfortunately, these attributes drive a kind of “Parkinson’s Law” of storage, in which demands continually push beyond...
متن کاملPacking Graphs: The packing problem solved
Abstract For every fixed graph H, we determine the H-packing number of Kn, for all n > n0(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists n0 = n0(H), such that for all n > n0, P (H, Kn) = b 2h b n − 1 d cc, unless n = 1 mod d and n(n − 1)/d = b mod (2h/d) where 1 ≤ b ≤ d, in which case P (H, Kn) = b 2h b n ...
متن کاملSecret sharing on trees: problem solved
We determine the worst case information rate for all secret sharing schemes based on trees. It is the inverse of 2 − 1/c, where c is the size of the maximal core in the tree. A core is a connected subset of the vertices so that every vertex in the core has a neighbor outside the core. The upper bound comes from an application of the entropy method [2, 3], while the lower bound is achieved by a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Nanotechnology
سال: 2009
ISSN: 1748-3387,1748-3395
DOI: 10.1038/nnano.2009.144